Visiting-Time-Shortening Framework Considering Pareto Optimality in Theme Park Problem
نویسندگان
چکیده
منابع مشابه
Pareto optimality in the Roommates problem
We consider Pareto optimal matchings as a means of coping with instances of the Stable Roommates problem (SR) that do not admit a stable matching. Given an instance I of SR, we show that the problem of finding a maximum Pareto optimal matching is solvable in O( √ nα(m,n)m log n) time, where n is the number of agents and m is the total length of the preference lists in I. By contrast we prove th...
متن کاملWeak Pareto Optimality of Multiobjective Problem in a Banach Space
In the previous paper ([5]), we studied the ordinary multiobjective convex program on a locally convex linear topological space in the case that the objective functions and the constraint functions were continuous and convex, but not always Gateaux differ entiable. In the case, we showed that the generalized Kuhn-Tucker conditions given by a subdifferential formula were necessary and sufficient...
متن کاملPareto-optimality of Compromise Decisions Pareto-optimality of Compromise Decisions
This paper deals with the problem of existence of compromise decisions and conditions for a compromise decision to be weakly Pareto-optimal, i.e., to be a weak Pareto-maximizer, Pareto-maximizer, or strong Pareto-maximizer. The concept of compromise decision is generalized by adopting triangular norms. Further, a concept of fuzzy interval is introduced. Suucient conditions for the existence of ...
متن کاملPareto Optimality in Coevolutionary Learning
We develop a novel coevolutionary algorithm based upon the concept of Pareto optimality. The Pareto criterion is core to conventional multi-objective optimization (MOO) algorithms. We can think of agents in a coevolutionary system as performing MOO, as well: An agent interacts with many other agents, each of which can be regarded as an objective for optimization. We adapt the Pareto concept to ...
متن کاملPareto Optimality in Abstract Argumentation
Since its introduction in the mid-nineties, Dung’s theory of abstract argumentation frameworks has been influential in artificial intelligence. Dung viewed arguments as abstract entities with a binary defeat relation among them. This enabled extensive analysis of different (semantic) argument acceptance criteria. However, little attention was given to comparing such criteria in relation to the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Japanese Society for Artificial Intelligence
سال: 2018
ISSN: 1346-0714,1346-8030
DOI: 10.1527/tjsai.c-h98